Peakedness of Distributions of Convex Combinations
نویسندگان
چکیده
منابع مشابه
Peakedness and peakedness ordering in symmetric distributions
There are many ways to measure the dispersion of a random variable. One such method uses the concept of peakedness. If the random variable X is symmetric about a point μ, then Birnbaum (1948) defined the function Pμ(x) = P (|X − μ| ≤ x), x ≥ 0, as the peakedness of X. If two random variables, X and Y , are symmetric about the points μ and ν, respectively, then X is said to be less peaked than Y...
متن کاملConvex combinations of harmonic shears of slit mappings
In this paper, we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings. Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived. Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...
متن کاملOn w-mixtures: Finite convex combinations of prescribed component distributions
We consider the space of w-mixtures that are the set of finite statistical mixtures sharing the same prescribed component distributions. The geometry induced by the Kullback-Leibler (KL) divergence on this family of w-mixtures is a dually flat space in information geometry called the mixture family manifold. It follows that the KL divergence between two w-mixtures is equivalent to a Bregman Div...
متن کاملConvex Sets and Convex Combinations
Convexity is one of the most important concepts in a study of analysis. Especially, it has been applied around the optimization problem widely. Our purpose is to define the concept of convexity of a set on Mizar, and to develop the generalities of convex analysis. The construction of this article is as follows: Convexity of the set is defined in the section 1. The section 2 gives the definition...
متن کاملConvex Hull, Set of Convex Combinations and Convex Cone
Let V be a real linear space. The functor ConvexComb(V ) yielding a set is defined by: (Def. 1) For every set L holds L ∈ ConvexComb(V ) iff L is a convex combination of V . Let V be a real linear space and let M be a non empty subset of V . The functor ConvexComb(M) yielding a set is defined as follows: (Def. 2) For every set L holds L ∈ ConvexComb(M) iff L is a convex combination of M . We no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1965
ISSN: 0003-4851
DOI: 10.1214/aoms/1177699798